By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 35, Issue 4, pp. ix-1005

Please Note: Electronic articles are available well in advance of the printed articles.

Special Issue: Dedicated To The Thirty-Sixth Annual ACM Symposium On Theory Of Computing (STOC 2004)
What Article options are available ?   View Cart   

Special Issue Dedicated To The Thirty-Sixth Annual ACM Symposium On Theory Of Computing (STOC 2004)

Laszlo Babai

pp. ix-x

BibTeX  Abstract FREE Full Text:  PDF

Approximating the Cut-Norm via Grothendieck's Inequality

Noga Alon and Assaf Naor

pp. 787-803

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Local Search by Quantum Arguments

Scott Aaronson

pp. 804-824

BibTeX  Abstract Full Text:  PDF

Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations

D. Bienstock and G. Iyengar

pp. 825-854

BibTeX  Abstract Full Text:  PDF

Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization

Rene Beier and Berthold Vöcking

pp. 855-881

BibTeX  Abstract Full Text:  PDF

Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus

Jonathan A. Kelner

pp. 882-902

BibTeX  Abstract Full Text:  PDF

Using Nondeterminism to Amplify Hardness

Alexander Healy, Salil Vadhan, and Emanuele Viola

pp. 903-931

BibTeX  Abstract Full Text:  PDF

Logarithmic Lower Bounds in the Cell-Probe Model

Mihai Patrascu and Erik D. Demaine

pp. 932-963

BibTeX  Abstract Full Text:  PDF

On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph

Uriel Feige

pp. 964-984

BibTeX  Abstract Full Text:  PDF

Hit-and-Run from a Corner

László Lovász and Santosh Vempala

pp. 985-1005

BibTeX  Abstract Full Text:  PDF